The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

times(x, y) → help(x, y, 0)
help(x, y, c) → if(lt(c, y), x, y, c)
if(true, x, y, c) → plus(x, help(x, y, s(c)))
if(false, x, y, c) → 0
lt(0, s(x)) → true
lt(s(x), 0) → false
lt(s(x), s(y)) → lt(x, y)
plus(x, 0) → x
plus(0, x) → x
plus(x, s(y)) → s(plus(x, y))
plus(s(x), y) → s(plus(x, y))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
lt(s(x), s(y)) →⁺ lt(x, y)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [x / s(x), y / s(y)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)